A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae
نویسندگان
چکیده
It is well known that the general problem of checking the satissability of a set of clauses is NP-complete. Experimentations have shown that there is a threshold on the ratio \number of clauses/number of variables" that separates the set of clauses for which a solution can be (easily) found from those for which it is impossible to nd a solution. The subject of this talk is the r-SAT problem, in which the clauses have a constant number r of literals. This summary is based on 2].
منابع مشابه
UPPER BOUND ON THE SATISFIABILITY THRESHOLD OF REGULAR RANDOM (k, s)-SAT PROBLEM
We consider a strictly regular random (k, s)-SAT problem and propose a GSRR model for generating its instances. By applying the first moment method and the asymptotic approximation of the γth coefficient for generating function f(z), where λ and γ are growing at a fixed rate, we obtain a new upper bound 2 log 2−(k+1) log 2/2+ εk for this problem, which is below the best current known upper boun...
متن کاملBounds on Threshold of Regular Random k-SAT
We consider the regular model of formula generation in conjunctive normal form (CNF) introduced by Boufkhad et. al. in [6]. In [6], it was shown that the threshold for regular random 2-SAT is equal to unity. Also, upper and lower bound on the threshold for regular random 3-SAT were derived. Using the first moment method, we derive an upper bound on the threshold for regular random k-SAT for any...
متن کاملSatisfiability Threshold of the Skewed Random k-SAT
We consider the satisfiability phase transition in skewed random k-SAT distributions. It is known that the random k-SAT model, in which the instance is a set of m k-clauses selected uniformly from the set of all k-clauses over n variables, has a satisfiability phase transition at a certain clause density. The essential feature of the random k-SAT is that positive and negative literals occur wit...
متن کاملTypical Random 3 - SAT Formulae and the Satis ability
3-SAT formulae are deened as nite sets of clauses, each clause being a disjunction of 3 literals over a set of boolean variables. Experiments on solving random 3-SAT formulae have provided strong evidence of a phase transition phenomenon. Explicitly, almost every random 3-SAT formula is satissable when its ratio: number of variables to number of clauses, denoted by c, is less than a value of ab...
متن کاملLower bounds for random 3-SAT via di'erential equations
It is widely believed that the probability of satis,ability for random k-SAT formulae exhibits a sharp threshold as a function of their clauses-to-variables ratio. For the most studied case, k = 3, there have been a number of results during the last decade providing upper and lower bounds for the threshold’s potential location. All lower bounds in this vein have been algorithmic, i.e., in each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 24 شماره
صفحات -
تاریخ انتشار 1997